منابع مشابه
Spectral ranking
This note tries to attempt a sketch of the history of spectral ranking—a general umbrella name for techniques that apply the theory of linear maps (in particular, eigenvalues and eigenvectors) to matrices that do not represent geometric transformations, but rather some kind of relationship between entities. Albeit recently made famous by the ample press coverage of Google’s PageRank algorithm, ...
متن کاملSerialRank: Spectral Ranking using Seriation
We describe a seriation algorithm for ranking a set of n items given pairwise comparisons between these items. Intuitively, the algorithm assigns similar rankings to items that compare similarly with all others. It does so by constructing a similarity matrix from pairwise comparisons, using seriation methods to reorder this matrix and construct a ranking. We first show that this spectral seriat...
متن کاملThe Push Algorithm for Spectral Ranking
The push algorithm was proposed first by Jeh and Widom [6] in the context of personalized PageRank computations (albeit the name “push algorithm” was actually used by Andersen, Chung and Lang in a subsequent paper [1]). In this note we describe the algorithm at a level of generality that make the computation of the spectral ranking of any nonnegative matrix possible. Actually, the main contribu...
متن کاملFast Spectral Ranking for Similarity Search
Despite the success of deep learning on representing images for particular object retrieval, recent studies show that the learned representations still lie on manifolds in a high dimensional space. Therefore, nearest neighbor search cannot be expected to be optimal for this task. Even if a nearest neighbor graph is computed offline, exploring the manifolds online remains expensive. This work in...
متن کاملA Spectral Approach to Collaborative Ranking
Knowing your customers and their needs is mandatory when conducting business. In an e-commerce environment, where one often knows much less about individual customers than in a face-to-face business, questionnaires besides historical transaction data and basic information like names and geographic location are popular means to get to know customers. Here we report on an approach to analyze pref...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Network Science
سال: 2016
ISSN: 2050-1242,2050-1250
DOI: 10.1017/nws.2016.21